package org.eoti.ai.pathfinding.astar.point;

/*
 * The MIT License
 *
 * Copyright (c) 2009 Malachi de AElfweald <malachid@gmail.com>
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

import org.eoti.ai.pathfinding.astar.AStarNode;

import java.awt.*;
import java.util.concurrent.CopyOnWriteArrayList;
import java.util.concurrent.locks.ReentrantReadWriteLock;

public class PointNode
	implements AStarNode<PointNode, Point>
{
	protected ReentrantReadWriteLock lock = new ReentrantReadWriteLock();
	protected Point location;
	protected PointNode parent;
	protected CopyOnWriteArrayList<PointNode> neighbors;
	protected double f=0.0;
	protected double g=0.0;
	protected double h=0.0;

	public PointNode(Point location)
	{
		lock.writeLock().lock();
		this.location = location;
		this.neighbors = new CopyOnWriteArrayList<PointNode>();
		lock.writeLock().unlock();
	}

	public PointNode getParent()
	{
		return parent;
	}

	public void setParent( PointNode node)
	{
		lock.writeLock().lock();
		this.parent = node;
		lock.writeLock().unlock();
	}

	public Point getLocation()
	{
		return location;
	}

	public java.util.List<PointNode> getNeighbors()
	{
		return neighbors;
	}

	public void addNeighbor( PointNode node)
	{
		lock.writeLock().lock();
		neighbors.add(node);
		lock.writeLock().unlock();
	}

	public void setActualCost(double g)
	{
		lock.writeLock().lock();
		this.g = g;
		this.f = g+h;
		lock.writeLock().unlock();
	}

	public double getActualCost()
	{
		return g;
	}

	public void setEstimatedCost(double h)
	{
		lock.writeLock().lock();
		this.h = h;
		this.f = g+h;
		lock.writeLock().unlock();
	}

	public double getEstimatedCost()
	{
		return h;
	}

	public double getTotalCost()
	{
		return f;
	}
}
